Simplified tea classification based on a reduced chemical composition profile via successive projections algorithm linear discriminant analysis (SPA-LDA)
نویسندگان
چکیده
منابع مشابه
1D-LDA vs. 2D-LDA: When is vector-based linear discriminant analysis better than matrix-based?
1 School of Mathematics and Computation Science Sun Yat-sen University Guangzhou, P. R. China, [email protected] 2 Department of Electronics & Communication Engineering, School of Information Science & Technology Sun Yat-sen University Guangzhou, P. R. China, [email protected] 3 Guangdong Province Key Laboratory of Information Security, P. R. China 4 Center for Biometrics and Security Rese...
متن کاملOn Model-Based Clustering, Classification, and Discriminant Analysis
The use of mixture models for clustering and classification has burgeoned into an important subfield of multivariate analysis. These approaches have been around for a half-century or so, with significant activity in the area over the past decade. The primary focus of this paper is to review work in model-based clustering, classification, and discriminant analysis, with particular attenti...
متن کامل2D-LDA: A statistical linear discriminant analysis for image matrix
This paper proposes an innovative algorithm named 2D-LDA, which directly extracts the proper features from image matrices based on Fisher s Linear Discriminant Analysis. We experimentally compare 2D-LDA to other feature extraction methods, such as 2D-PCA, Eigenfaces and Fisherfaces. And 2D-LDA achieves the best performance. 2004 Elsevier B.V. All rights reserved.
متن کاملBoosted Linear Projections for Discriminant Analysis
In this paper we explain a new linear Discriminant technique to project high dimensional data into a low dimensional subspace where the accuracy of the nearest neighbor classifier is maximized. Our algorithm combines a set of one-dimensional projections, using the Adaboost algorithm, to form the final discriminant projection matrix. We also introduce the way to establish an order to rank the fe...
متن کاملMultiple Instance Classification via Successive Linear Programming
The multiple instance classification problem [6,2,12] is formulated using a linear or nonlinear kernel as the minimization of a linear function in a finite dimensional (noninteger) real space subject to linear and bilinear constraints. A linearization algorithm is proposed that solves a succession of fast linear programs that converges in a few iterations to a local solution. Computational resu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Food Composition and Analysis
سال: 2015
ISSN: 0889-1575
DOI: 10.1016/j.jfca.2014.11.012